A Fast Association Rules Mining Algorithm for Dynamic Updated Databases

Fast Algorithm for Mining Generalized Association Rules

In this paper, we present a new algorithm for mining generalized association rules. We develop the algorithm which scans database one time only and use Tidset to compute the support of generalized itemset faster. A tree structure called GIT-tree, an extension of IT-tree, is developed to store database for mining frequent itemsets from hierarchical database. Our algorithm is often faster than MM...

A Fast Distributed Algorithm for Mining Association Rules

An Eecient Algorithm for Mining Association Rules in Large Databases

Mining for association rules between items in a large database of sales transactions has been described as an important database mining problem. In this paper we present an eecient algorithm for mining association rules that is fundamentally diierent from known algorithms. Compared to the previous algorithms, our algorithm reduces both CPU and I/O overheads. In our experimental study it was fou...

An Efficient Algorithm for Mining Association Rules in Large Databases

Mining for a.ssociation rules between items in a large database of sales transactions has been described as an important database mining problem. In this paper we present an efficient algorithm for mining association rules that is fundamentally different from known algorithms. Compared to previous algorithms, our algorithm not only reduces the I/O overhead significantly but also has lower CPU o...

Fast Algorithm for Generating Association Rules with Encoding Databases Layout

databases to small one is proposed. Significant efficiency is obtained by applying some modified known algorithm on our proposed database layout. In addition, an new algorithm based on the proposed encoding method is introduced. Using some properties of numbers our database converts itemset to numerical domain. Our implementation indicates that the proposed layout made the size of database sign...